back edge - traducción al ruso
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

back edge - traducción al ruso

SEARCH ALGORITHM
Depth first search; Depth-first; DFS algorithm; Depth-first traversal; Depth-First Search; Back edge; Forward edge; Depth First Search; Applications of depth-first search
  • Animated example of a depth-first search
  • Order in which the nodes get expanded
  • The example graph, copied from above
  • alt=A directed graph with edges AB, BD, AC, CD
  • Randomized algorithm similar to depth-first search used in generating a maze.
  • The four types of edges defined by a spanning tree

back edge         
1) задняя кромка (листа)
2) корешковое поле
forward edge         

математика

прямое ребро

depth-first search         

общая лексика

поиск в глубину

в ИИ - алгоритм поиска в пространстве решений (см. decision space), при котором сначала просматриваются состояния на одном пути, а затем происходит возврат назад и формируется следующий путь. Алгоритм может не закончить свою работу, если пространство состояний бесконечно

Смотрите также

breadth-first search; heuristic search; search

Definición

depth-first search
<algorithm> A graph search algorithm which extends the current path as far as possible before backtracking to the last choice point and trying the next alternative path. Depth-first search may fail to find a solution if it enters a cycle in the graph. This can be avoided if we never extend a path to a node which it already contains. Opposite of breadth first search. See also {iterative deepening}. (1995-04-19)

Wikipedia

Depth-first search

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. The algorithm starts at the root node (selecting some arbitrary node as the root node in the case of a graph) and explores as far as possible along each branch before backtracking. Extra memory, usually a stack, is needed to keep track of the nodes discovered so far along a specified branch which helps in backtracking of the graph.

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux as a strategy for solving mazes.

Ejemplos de uso de back edge
1. They considered eliminating the foam wedges, reducing them or building a kind of "fence" on the back edge of the rectangular tray that holds cables to redirect the wind.
2. On 18, he sailed a fairway wood over the water–protected green into the rough just off the back edge, and again got down in two with a birdie on the 547–yard hole.
¿Cómo se dice back edge en Ruso? Traducción de &#39back edge&#39 al Ruso